Two Practical and Provably Secure Block Ciphers: BEAR and LION
نویسندگان
چکیده
In this paper we suggest two new provably secure block ciphers , called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoo construction. Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which nd their keys would yield attacks on one or both of the underlying components. They also have the potential to be much faster than existing block ciphers in many applications.
منابع مشابه
A Critique of BEAR and LION
The paper \Two Practical and Provably Secure Block Ciphers: BEAR and LION" AnBi96] by Ross Anderson and Eli Biham is summarized. The paper presents two new block ciphers (BEAR and LION) which can be built using a hash function and a stream cipher. Both these ciphers are provably secure in that a successful attack on them can be used as an attack on the underlying hash function and stream cipher...
متن کاملTwo Practical and Provably Secure Block Ciphers: BEARS and LION
In this paper we suggest two new provably secure block ciphers , called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoo construction. Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which nd their keys would yield attacks on one or both of the underlying components. They also have the p...
متن کاملProvably Secure and E cient Block Ciphers
The security and eciency of two recently proposed block ciphers, bear and lion, both based on a hash function and a stream cipher, is discussed. Meet-in-the-middle attacks are presented which can be used to dramatically reduce the complexity of a brute-force key search on both these ciphers. A new block cipher is described which is not susceptible to meet-in-the-middle attacks, is provably secu...
متن کاملNew Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Abst rac t . We introduce a methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable securit...
متن کاملConstructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
Almost all current block-cipher-based MACs reduce their security to the pseudorandomness of their underlying block ciphers, except for a few of them to the unpredictability, a strictly weaker security notion than pseudorandomness. However, the latter MACs offer relatively low efficiency. In this paper, we investigate the feasibility of constructing rate-1 MACs from related-key unpredictable blo...
متن کامل